/**
 * @file contests/cf1698/c/main.cpp
 * @brief
 * @see
 * @author Ruiming Guo (guoruiming@stu.scu.edu.cn)
 * @copyright 2022
 * @date 2022/7/10 15:03:24
 **/

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
  // High rating and good luck!
  int tc;
  cin >> tc;
  while (tc--) {
    vector<int> pos, neg, zero;
    int n;
    cin >> n;
    while (n--) {
      int a;
      cin >> a;
      if (a > 0)
        pos.push_back(a);
      else if (a < 0)
        neg.push_back(a);
      else {
        if (zero.size() < 2) zero.push_back(a);
      }
    }
    if (pos.size() > 2 || neg.size() > 2) {
      cout << "NO\n";
      continue;
    }

    vector<int> v;
    for (auto e : pos) v.push_back(e);
    for (auto e : neg) v.push_back(e);
    for (auto e : zero) v.push_back(0);
    set<int> s(v.begin(), v.end());
    bool ok = true;
    for (int i = 0; i < v.size() - 2; ++i)
      for (int j = i + 1; j < v.size() - 1; ++j)
        for (int k = j + 1; k < v.size(); ++k)
          if (!s.count(v[i] + v[j] + v[k])) {
            ok = false;
            break;
          }
    cout << (ok ? "YES\n" : "NO\n");
  }

  return 0;
}
